Hyper
نویسندگان
چکیده
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known algorithms for computing the hyperbolicity number of a graph (the smaller, the more tree-like) have running time O(n), where n is the number of graph vertices. Exploiting the framework of parameterized complexity analysis, we explore possibilities for “linear-time FPT” algorithms to compute hyperbolicity. For instance, we show that hyperbolicity can be computed in time O(2 +n+m) (m being the number of graph edges) while at the same time, unless the SETH fails, there is no 2n-time algorithm.
منابع مشابه
Hyper-tubes of hyper-cubes
Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
متن کاملPOSITIVE IMPLICATIVE HYPER MV -IDEALS OF TYPES 1,2,3, AND 4
In this paper rst we dene the notions of positive implicativehyper MV -ideals of types 1,2,3 and 4 in hyper MV -algebras and we investigatethe relationship between of them . Then by some examples we show that thesenotions are not equivalent. Finally we give some relations between these notionsand the notions of (weak) hyper MV -ideals and (weak) hyper MV -deductivesystems of hyper MV -algebras.
متن کاملSOME HYPER K-ALGEBRAIC STRUCTURES INDUCED BY MAX-MIN GENERAL FUZZY AUTOMATA
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...
متن کاملLattice of weak hyper K-ideals of a hyper K-algebra
In this note, we study the lattice structure on the class of all weak hyper K-ideals of a hyper K-algebra. We first introduce the notion of (left,right) scalar in a hyper K-algebra which help us to characterize the weak hyper K-ideals generated by a subset. In the sequel, using the notion of a closure operator, we study the lattice of all weak hyper K-ideals of ahyper K-algebra, and we prove a ...
متن کاملINTUITIONISTIC FUZZY HYPER BCK-IDEALS OF HYPER BCK-ALGEBRAS
The intuitionistic fuzzification of (strong, weak, s-weak) hyperBCK-ideals is introduced, and related properties are investigated. Characterizationsof an intuitionistic fuzzy hyper BCK-ideal are established. Using acollection of hyper BCK-ideals with some conditions, an intuitionistic fuzzyhyper BCK-ideal is built.
متن کاملSome result on simple hyper K-algebras
A simple method is described, to prove some theorems for simple hyper K-algebras and to study positive implicative hyper K-ideals, weak (implicative ) hyper K-ideals in simple hyper K-algebras . Beside, some results on positive implicative and (weak) implicative simple hyper K-algebras are presented. Finally classification of simple hyper Kalgebras of order 4, which are satisfied in conditions ...
متن کامل